Complexity of Langton's ant
نویسندگان
چکیده
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with the trajectory of a single ant. This proves the P-hardness of the system and implies, through the simulation of one-dimensional cellular automata and Turing machines, the universality of the ant and the undecidability of some problems associated to it. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Generalized Langton's Ant: Dynamical Behavior and Complexity
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between characteristics of finite graphs and the dynamics of the ant on them. Then we consider the infinite bi-regular graphs of degrees 3 and 4, where we prove the universality of the system, and in the particular cases of the ...
متن کاملCompression Depth and the Behavior of Cellular Automata 1
A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure , which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classiication sche...
متن کاملFrom Complexity to Random Behaviors; Generate Random Numbers by Confusion in Cellular Automata State’s
Cellular Automata(CA) with evolutionary and complex behaviors are used in several applications such as generating random numbers and cryptography. Because of the intrinsic self-organizing property, pure CA cannot produce a long sequence of random numbers. For increasing the sequence of produced numbers, nonuniform CA, controllable/programmable CA, stimulating factors or combination of several a...
متن کاملDynamical behavior and complexity of Langton's ant
O ne of the first models of artificial life, proposed back in the 1980s by Christopher Langton, founder of the field, was the virtual ant [1,2]. This simple cellular automaton is defined on the square grid in the following way: each square (“cell”) of the grid can be in one of two states, white or black, and the ant is represented by a short arrow that stands on one cell and points to the north...
متن کاملCompression Depth and the Behavior of Cellular
A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 117 شماره
صفحات -
تاریخ انتشار 2002